A nonlinear aggregation type classifier

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable Semi-Supervised Classifier Aggregation

We present and empirically evaluate an efficient algorithm that learns to aggregate the predictions of an ensemble of binary classifiers. The algorithm uses the structure of the ensemble predictions on unlabeled data to yield significant performance improvements. It does this without making assumptions on the structure or origin of the ensemble, without parameters, and as scalably as linear lea...

متن کامل

COBRA: A Nonlinear Aggregation Strategy

Abstract A new method for combining several initial estimators of the regression function is introduced. Instead of building a linear or convex optimized combination over a collection of basic estimators r1, . . . , rM , we use them as a collective indicator of the distance between the training data and a test observation. This local distance approach is model-free and extremely fast. Most impo...

متن کامل

Feature Selection For a Nonlinear Classifier

The nonlinear classiier is eeective for many practical problems. We have already proposed a method for constructing a nonlinear classiier using Legendre polynomials and have obtained good results on many actual data. In this approach, a set of original features is rst extended to a large number of new features in a nonlinear fashion and then some substantial features are chosen for the nonlinea...

متن کامل

Optimal Binary Classifier Aggregation for General Losses

We address the problem of aggregating an ensemble of predictors with known loss bounds in a semi-supervised binary classification setting, to minimize prediction loss incurred on the unlabeled data. We find the minimax optimal predictions for a very general class of loss functions including all convex and many non-convex losses, extending a recent analysis of the problem for misclassification e...

متن کامل

Minimax Binary Classifier Aggregation with General Losses

We address the problem of aggregating an ensemble of predictors with known loss bounds in a semi-supervised binary classification setting, to minimize prediction loss incurred on the unlabeled data. We find the minimax optimal predictions for a very general class of loss functions including all convex and many non-convex losses, extending a recent analysis of the problem for misclassification e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Multivariate Analysis

سال: 2016

ISSN: 0047-259X

DOI: 10.1016/j.jmva.2015.09.022